منابع مشابه
Path Problems in Temporal Graphs
Shortest path is a fundamental graph problem with numerous applications. However, the concept of classic shortest path is insufficient or even flawed in a temporal graph, as the temporal information determines the order of activities along any path. In this paper, we show the shortcomings of classic shortest path in a temporal graph, and study various concepts of “shortest” path for temporal gr...
متن کاملPath problems in dynamically orientable graphs
SlIlllplllcny let each edge results. We are the k-train problem.
متن کاملQuadratic Semi-Assignment Problems on Structured Graphs
The paper presents a class of polynomially solvable instances of Quadratic SemiAssignment Problem. Some properties of this class are illustrated. In the light of these results lower bounds and solution techniques for the general case are proposed. A computational comparison of some lower bounds is reported.
متن کاملLongest Path Problems on Ptolemaic Graphs
SUMMARY Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, there are few known graph classes such that the longest path problem can be solved efficiently. Polynomial time algorithms for finding a longest cycle and a longest path in a Ptolemaic graph are pr...
متن کاملSensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
Abstract. Let G = (N,A) be an undirected graph with n nodes and m arcs, a designated source node s and a sink node t. This paper addresses sensitivity analysis questions concerning the shortest s-t path (SP) problem in G and the maximum capacity s-t path (MCP) problem in G. Suppose that P* is a shortest s-t path in G with respect to a nonnegative distance vector c. For each arc e ∈ A, the lower...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1986
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/29.6.553